Mittag-Leffler function and fractional differential equations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractional differential equations for the generalized Mittag-Leffler function

*Correspondence: [email protected] 3Department of Mathematical Sciences, UAE University, Al Ain, United Arab Emirates Full list of author information is available at the end of the article Abstract In this paper, we establish some (presumably new) differential equation formulas for the extended Mittag-Leffler-type function by using the Saigo-Maeda fractional differential operators involvin...

متن کامل

Cascade of Fractional Differential Equations and Generalized Mittag-Leffler Stability

This paper address a new vision for the generalized Mittag-Leffler stability of the fractional differential equations. We mainly focus on a new method, consisting of decomposing a given fractional differential equation into a cascade of many sub-fractional differential equations. And we propose a procedure for analyzing the generalized Mittag-Leffler stability for the given fractional different...

متن کامل

Mittag-Leffler-Hyers-Ulam Stability of Fractional Differential Equation

In this article, we study the Mittag-Leffler-Hyers-Ulam and Mittag-Leffler-Hyers-Ulam-Rassias stability of a class of fractional differential equation with boundary condition.

متن کامل

Incomplete Mittag - Leffler Function

This paper devoted to the study of incomplete Mittag-Leffler function and some of its properties in terms of incomplete Wright function. 2000 Mathematics Subject Classification: 33E12, 33B15, 11S80.

متن کامل

Discrete Mittag-Leffler Functions in Linear Fractional Difference Equations

and Applied Analysis 3 and define recursively a∇−nf t ∫ t a a∇−n 1f τ ∇τ 2.4 for n 2, 3, . . .. Then we have the following. Proposition 2.1 Nabla Cauchy formula . Let n ∈ Z , a, b ∈ T and let f : T → R be ∇-integrable on a, b ∩ T. If t ∈ T, a ≤ t ≤ b, then a∇−nf t ∫ t a ̂ hn−1 ( t, ρ τ ) f τ ∇τ . 2.5 Proof. This assertion can be proved by induction. If n 1, then 2.5 obviously holds. Let n ≥ 2 an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fractional Calculus and Applied Analysis

سال: 2018

ISSN: 1314-2224,1311-0454

DOI: 10.1515/fca-2018-0014